Graph Isomorphism

Analysis on Complexity of Graph Isomorphism Problem

关于图同构复杂性的分析

Determining whether two graphs are isomorphic is referred to as the graph isomorphism problem.

确定是否是同构的两个图形称为图同构问题.

Security patch comparison techniques based on graph isomorphism theory

基于图形同构理论的安全补丁比较技术

The path layer matrix is closely related to graph isomorphism.

图的路径层矩阵与图的同构问题密切相关.

The identification of graphs'isomorphism is one of the basic problems in graph theory.

图的同构判定是图论学科的基本问题之一.

For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.

对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。

Discussed in this paper are a class of imprimitive arc-transitive connected Cayley Graphs on Z p × Zp. We prove that, up to a graph isomorphism, there is only one such graph, that is G ( p, r) [ pK1].

对Z p×Z p上的一类弧传递非本原连通Cayley图进行了讨论，证明了这类图的不同构类型只有一个，即G（p，r）[pK1]。

As we known, the graph isomorphism problem is still in NP.

众所周知，图同构的判定问题是NP问题。